Elliptic curve Cryptography and Diffie- Hellman Key exchange
نویسندگان
چکیده
منابع مشابه
Quantum-Resistant Diffie-Hellman Key Exchange from Supersingular Elliptic Curve Isogenies
Possibility of the emergence of quantum computers in the near future, pose a serious threat against the security of widely-used public key cryptosystems such as RSA or Elliptic Curve Cryptography (ECC). Algorithms involving isogeny computations on supersingular elliptic curves have been shown to be difficult to break, even to quantum computers. Thus, isogeny-based protocols represent promising ...
متن کاملDiffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملAuthenticated Diffie-Hellman Key Exchange Algorithm
The ability to distribute cryptographic keys has been a challenge for centuries. The Diffie-Hellman was the first practical solution to the problem .However, if the key exchange takes place in certain mathematical environments, the key exchange become vulnerable to a specific Man-inMiddle attack, first observed by Vanstone. This paper is an effort to solve a serious problem in Diffie-Hellman ke...
متن کاملInterpolation of the Elliptic Curve Diffie-Hellman Mapping
We prove lower bounds on the degree of polynomials interpolating the Diffie–Hellman mapping for elliptic curves over finite fields and some related mappings including the discrete logarithm. Our results support the assumption that the elliptic curve Diffie–Hellman key exchange and related cryptosystems are secure.
متن کاملOn the Bit Security of Elliptic Curve Diffie-Hellman
This paper gives the first bit security result for the elliptic curve Diffie–Hellman key exchange protocol for elliptic curves defined over prime fields. About 5/6 of the most significant bits of the x-coordinate of the Diffie–Hellman key are as hard to compute as the entire key. A similar result can be derived for the 5/6 lower bits. The paper also generalizes and improves the result for ellip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2017
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-1301015661